solving a mathematical model with multi warehouses and retailers in distribution network by a simulated annealing algorithm

نویسندگان

s ebrahimnezhad

h javanshir

a najafi

چکیده

determination of shipment quantity and distribution problem is an important subject in today’s business. this paper describes the inventory/distribution network design. the system addresses a class of distribution network design problem, which is characterized by multiple products family, multiple warehouses and retail-ers. the maximum capacity of vehicles and warehouses are also known. the resulting system focuses on two key goals: minimizing the lost sales cost as a costumer’s satisfaction factor and balancing sum of service dis-tances for different warehouses. in this paper we consider the distribution network problem formulated by 0-1 mixed integer linear programming model. due to difficulty of obtaining the optimum solution in medium and large scale problems, a simulated annealing algorithm (sa) is also applied. the efficiency of this algorithm is demonstrated by comparing its numerical experiment results with those of sa algorithm and lingo 6. package.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a mathematical model with multi warehouses and retailers in distribution network by a simulated annealing algorithm

Determination of shipment quantity and distribution problem is an important subject in today’s business. This paper describes the inventory/distribution network design. The system addresses a class of distribution network design problem, which is characterized by multiple products family, multiple warehouses and retail-ers. The maximum capacity of vehicles and warehouses are also known. The res...

متن کامل

Solving a New Multi-Period Mathematical Model of the Rail-Car Fleet Size and Car Utilization by Simulated Annealing

There is a significant interaction between sizing a fleet of rail cars and its utilization. This paper presents a new multi-period mathematical model and a solution procedure to optimize the rail-car fleet size and freight car allocation, wherein car demands, and travel times, are assumed to be deterministic, and unmet demands are backordered. This problem is considered NP-complete. In other wo...

متن کامل

A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

solving a stochastic multi-depot multi-objective vehicle routing problem by a simulated annealing

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

متن کامل

َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial engineering, international

ISSN 1735-5702

دوره 6

شماره 10 2010

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023